CRUSH: A New Lossless Compression Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A lossless compression algorithm for hyperspectral data

In this paper, which is an expository account of a lossless compression techniques that have been developed over the course of a sequence of papers and talks, we have sought to identify and bring out the key features of our approach to the efficient compression of hyperspectral satellite data. In particular we provide the motivation for using our approach, which combines the advantages of a clu...

متن کامل

A Block - sorting Lossless Data Compression Algorithm

The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment in 1984, we have performed basic and applied research to support Digital's business objectives. Our current work includes exploring distributed personal computing on multiple platforms, networking , programming technology, system modelling and management techniques, ...

متن کامل

An Improved Hierarchical Lossless Text Compression Algorithm

Several improvements to the Bugajski-Russo N-gram algorithm are proposed. When applied to English text these result in an algorithm with comparable complexity and approximately 10 to 30% less rate than the commonly used COMPRESS algorithm. I. The N-Gram Algorithm The N-gram algorithm of Bugajski and Russo [1] is a hierarchical dictionary-type universal lossless source coder for a finite source ...

متن کامل

Lossless Compression Algorithm for Hierarchical Ic Layout

Lossless Compression Algorithm for Hierarchical IC Layout

متن کامل

The Block Lossless Data Compression Algorithm

The mainstream lossless data compression algorithms have been extensively studied in recent years. However, rather less attention has been paid to the block algorithm of those algorithms. The aim of this study was therefore to investigate the block performance of those methods. The main idea of this paper is to break the input into different sized blocks, compress separately, and compare the re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Modern Applied Science

سال: 2018

ISSN: 1913-1852,1913-1844

DOI: 10.5539/mas.v12n11p387